Maximum walk entropy implies walk regularity
نویسندگان
چکیده
Article history: Received 2 March 2014 Accepted 18 June 2014 Available online 9 July 2014 Submitted by R. Brualdi MSC: 05C50 15A16 82C20
منابع مشابه
Sinai's Walk : a Statistical Aspect (preliminary Version)
In this paper we are interested in Sinai’s walk i.e a one dimensional random walk in random environment with three conditions on the random environment: two necessaries hypothesis to get a recurrent process (see [Solomon(1975)]) which is not a simple random walk and an hypothesis of regularity which allows us to have a good control on the fluctuations of the random environment. The asymptotic b...
متن کاملBlack Holes, Space-Filling Chains and Random Walks
Many approaches to a semiclassical description of gravity lead to an integer black hole entropy. In four dimensions this implies that the Schwarzschild radius obeys a formula which describes the distance covered by a Brownian random walk. For the higher-dimensional Schwarzschild-Tangherlini black hole, its radius relates similarly to a fractional Brownian walk. We propose a possible microscopic...
متن کاملErgodic Theory on Galton-Watson Trees: Speed of Random Walk and Dimension of Harmonic Measure
We consider simple random walk on the family tree T of a nondegenerate supercritical Galton-Watson branching process and show that the resulting harmonic measure has a.s. strictly smaller Hausdorff dimension than that of the whole boundary of T . Concretely, this implies that an exponentially small fraction of the nth level of T carries most of the harmonic measure. First order asymptotics for ...
متن کاملLocalization of the maximal entropy random walk.
We define a new class of random walk processes which maximize entropy. This maximal entropy random walk is equivalent to generic random walk if it takes place on a regular lattice, but it is not if the underlying lattice is irregular. In particular, we consider a lattice with weak dilution. We show that the stationary probability of finding a particle performing maximal entropy random walk loca...
متن کاملWalk-regular divisible design graphs
A divisible design graph (DDG for short) is a graph whose adjacency matrix is the incidence matrix of a divisible design. DDGs were introduced by Kharaghani, Meulenberg and the second author as a generalization of (v, k, λ)-graphs. It turns out that most (but not all) of the known examples of DDGs are walk-regular. In this paper we present an easy criterion for this to happen. In several cases ...
متن کامل